On converting CNF to DNF
نویسندگان
چکیده
منابع مشابه
On Converting CNF to DNF
We study how big the blow-up in size can be when one switches between the CNF and DNF representations of boolean functions. For a function f : {0, 1}n → {0, 1}, cnfsize(f) denotes the minimum number of clauses in a CNF for f ; similarly, dnfsize(f) denotes the minimum number of terms in a DNF for f . For 0 ≤ m ≤ 2n−1, let dnfsize(m, n) be the maximum dnfsize(f) for a function f : {0, 1}n → {0, ...
متن کاملBackpropagation for Neural Dnf{ and Cnf{networks
The architecture of a neural network with its links and weights can be viewed as a knowledge representation. To overcome the black{box problem of not knowing what knowledge is hidden in a neural architecture, we present a strictly logically operating network. Each neuron represents either a disjunc-tion or conjunction of its inputs and the net thus performs the function of a logic formula. This...
متن کاملA Relationship Between CNF and DNF Systems Derivable from Examples
In learning from examples, the main goal is to use a collection of positive examples and a collection of negative examples to derive a Boolean expression which satisfies the requirements imposed by the examples. In order to represent such a Boolean expression, the conjunctive normal form (CNF) and the disjunctive normal form (DNF) have been proposed. This paper makes two contributions. First it...
متن کاملOn the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
Given the irredundant CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding unique irredundant DNF representation ψ of f . The (generalized) multiplication method works by repeatedly dividing the clauses of φ into (not necessarily disjoint) groups, multiplying-out the clauses in each group, and then reducing the res...
متن کاملOn the Effectiveness of CNF and DNF Representations in Contingent Planning
This paper investigates the effectiveness of two state representations, CNF and DNF, in contingent planning. To this end, we developed a new contingent planner, called CNFct, using the AND/OR forward search algorithm PrAO [To et al., 2011] and an extension of the CNF representation of [To et al., 2010] for conformant planning to handle nondeterministic and sensing actions for contingent plannin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2003
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v10i45.21817